Distance-Based Topological Polynomials Associated with Zero-Divisor Graphs
نویسندگان
چکیده
Let R be a commutative ring with nonzero identity and let id="M2"> Z its set of zero divisors. The zero-divisor graph id="M3"> is the id="M4"> ? vertex id="M5"> V = ? , where id="M6"> \ open="{" close="}" 0 edge id="M7"> E x , y : ? . One basic results for these graphs that id="M8"> connected diameter less than or equal to 3. In this paper, we obtain few distance-based topological polynomials indices when id="M9"> ? p 2 q namely, Wiener index, Hosoya polynomial, Shultz modified polynomials.
منابع مشابه
$C_4$-free zero-divisor graphs
In this paper we give a characterization for all commutative rings with $1$ whose zero-divisor graphs are $C_4$-free.
متن کاملOn zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملA generalization of zero-divisor graphs
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
متن کاملDistance-based topological polynomials and indices of friendship graphs
Drugs and chemical compounds are often modeled as graphs in which the each vertex of the graph expresses an atom of molecule and covalent bounds between atoms are represented by the edges between their corresponding vertices. The topological indicators defined over this molecular graph have been shown to be strongly correlated to various chemical properties of the compounds. In this article, by...
متن کاملDistance-based topological indices of tensor product of graphs
Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2021
ISSN: ['1026-7077', '1563-5147', '1024-123X']
DOI: https://doi.org/10.1155/2021/4959559